Probabilistic Indoor Tracking of Mobile Wireless Nodes Relative to Landmarks

نویسندگان

  • Keyong Li
  • Dong Guo
  • Yingwei Lin
  • Ioannis Ch. Paschalidis
چکیده

The profile-based approach is known to be advantageous when it comes to inferring positions of mobile wireless devices in complex indoor environments. The past decade has seen a significant body of work that explores different implementations of this approach, with varying degrees of success. Here, we cast the profile-based approach in a probabilistic framework. Launching from the theoretical basis that this framework provides, we provide a suite of carefully designed methods that make use of sophisticated computations in pursuit of high localization accuracy with low hardware investment and moderate set-up cost. More specifically, we use full distributional information on signal measurements at a set of discrete locations, termed landmarks. Positioning of a mobile node is done relative to the resulting landmark graph and the node can be found near a landmark or in the area between two landmarks. Key elements of our approach include profiling the signal measurement distributions over the coverage area using a special interpolation technique; a two-tier statistical positioning scheme that improves efficiency by adding movement detection; and joint clusterhead placement optimization for both localization and movement detection. The proposed system is practical and has been implemented using standard wireless sensor network hardware. Experimentally, our system achieved an accuracy equivalent to less than 5 meters with a 95% success probability and less than 3 meters with an 87% success probability. This performance is superior to well-known contemporary systems that use similar low-cost hardware. * Research partially supported by the NSF under grants EFRI-0735974, CNS-1239021, and IIS-1237022, by the ARO under grants W911NF-11-1-0227 and W911NF-12-1-0390, and by the ONR under grant N00014-10-1-0952. ‡ Center for Information & Systems Eng., Boston University, e-mail: [email protected]. § Center for Information & Systems Eng., Boston University, e-mail: [email protected]. ¶ Center for Information & Systems Eng., Boston University, e-mail: [email protected]. † Corresponding author. Dept. of Electrical & Computer Eng., Division of Systems Eng., and Center for Information & Systems Eng., Boston University, 8 St. Mary’s St., Boston, MA 02215, e-mail: [email protected], url: http://ionia.bu.edu/. January 26, 2013 DRAFT

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Energy-Aware Probabilistic Epidemic Forwarding Method in Heterogeneous Delay Tolerant Networks

Due to the increasing use of wireless communications, infrastructure-less networks such as Delay Tolerant Networks (DTNs) should be highly considered. DTN is most suitable where there is an intermittent connection between communicating nodes such as wireless mobile ad hoc network nodes. In general, a message sending node in DTN copies the message and transmits it to nodes which it encounters. A...

متن کامل

LPKP: location-based probabilistic key pre-distribution scheme for large-scale wireless sensor networks using graph coloring

Communication security of wireless sensor networks is achieved using cryptographic keys assigned to the nodes. Due to resource constraints in such networks, random key pre-distribution schemes are of high interest. Although in most of these schemes no location information is considered, there are scenarios that location information can be obtained by nodes after their deployment. In this paper,...

متن کامل

An Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks

This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...

متن کامل

An Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks

This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...

متن کامل

3D Path Planning Algorithm for Mobile Anchor-Assisted Positioning in Wireless Sensor Networks

Positioning service is one of Wireless Sensor Networks’ (WSNs) fundamental services. The accurate position of the sensor nodes plays a vital role in many applications of WSNs. In this paper, a 3D positioning algorithm is being proposed, using mobile anchor node to assist sensor nodes in order to estimate their positions in a 3D geospatial environment. However, mobile anchor node’s 3D path optim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013